A graphical characterization of the largest chain graphs
نویسندگان
چکیده
The paper presents a graphical characterization of the largest chain graphs which serve as unique representatives of classes of Markov equivalent chain graphs. The characterization is a basis for an algorithm constructing, for a given chain graph, the largest chain graph equivalent to it. The algorithm was used to generate a catalog of the largest chain graphs with at most ve vertices. Every item of the catalog contains the largest chain graph of a class of Markov equivalent chain graphs and an economical record of the induced independency model.
منابع مشابه
Characterization of Essential Graphs by Means of an Operation of Legal Component Merging
One of the most common ways of representing classes of equivalent Bayesian networks is the use of essential graphs. These chain graphs are also known in the literature as completed patterns or completed pdags. The name essential graph was proposed by Andersson, Madigan and Perlman (1997a) who also gave a graphical characterization of essential graphs. In this contribution an alternative charact...
متن کاملOn Block Ordering of Variables in Graphical Modelling
In graphical modelling, the existence of substantive background knowledge on block ordering of variables is used to perform structural learning within the family of chain graphs (CGs) in which every block corresponds to an undirected graph and edges joining vertices in different blocks are directed in accordance with the ordering.We show that this practice may lead to an inappropriate restricti...
متن کاملOn Recovery Algorithm for Chain Graphs
The class of chain graphs (CGs) involving both undirected graphs (= Markov networks) and directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is CGs describing the same conditional independence structure) has a natural representative, which is called the la...
متن کاملA recovery algorithm for chain graphs
The class of chain graphs (CGs) involving both undirected graphs (=Markov networks) and directed acyclic graphs (= Bayesian networks) was introduced in middle eighties for description of probabilistic conditional independence structures. Every class of Markov equivalent CGs (that is, CGs describing the same conditional independence structure) has a natural representative, which is called the la...
متن کاملBayesian Networks from the Point of View of Chain Graphs
The paper gives a few arguments in favour of use of chain graphs for description of proba bilistic conditional independence structures. Every Bayesian network model can be equiva lently introduced by means of a factorization formula with respect to chain graph which is Markov equivalent to the Bayesian network. A graphical characterization of such graphs is given. The class of equivalent grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 20 شماره
صفحات -
تاریخ انتشار 1999